Two linear time Union-Find strategies for image processing
نویسندگان
چکیده
منابع مشابه
Linear Expected Time of a Simple Union-Find Algorithm
This paper presents an analysis of a simple tree-structured disjoint set Union-Find algorithm, and shows that this algorithm requires between n and 2n steps on the average to execute a sequence of n Union and Find instructions, assuming that each pair of existing classes is equally likely to be merged by a Union instruction. Union-Find algorithms are useful in the solution to a number of proble...
متن کاملThe Union-Find Problem Is Linear
The union-find problem, also known as the disjoint set union problem, involves two operations, union and find, on a collection of disjoint sets. The worst case time complexity of a sequence of n such operations was known to be near linear. We prove that its worst case time complexity is linear. The new proof technique is based on amortized complexity analysis and transformation. Our proof is su...
متن کاملDeriving Quasi-Linear-Time Algorithms from Union-Find in CHR Extended Abstract
The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR from equality to arbitrary binary relations. By choosing the appropriate relations, we can derive fast algorithms for solving certain propositional logic (SAT) problems as well as certain polynomial equations in two variables. ...
متن کاملQuasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR from equality to arbitrary binary relations. By choosing the appropriate relations, we can derive fast incremental algorithms for solving certain propositional logic (SAT) problems and polynomial equations in two variables. In ...
متن کاملUnion-Find volume segmentation
We present an efficient method to segment large 3d images that takes the whole 3-dimensional structure into account. We use a Union-Find data structure to record and maintain the necessary informations during the segmentation process. This structure leads to a volume labelling and facilitates interactive process by linking directly voxels to the volume they belong to. Moreover the global integr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00262-2